1334A - Level Statistics - CodeForces Solution

implementation math *1200

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):
    n = int(input())
    p, c = [], []

    for i in range(n):
        x, y = map(int, input().split())
        p.append(x)
        c.append(y)

    t = 'YES'
    for i in range(1, n):
        x = p[i] - p[i-1]
        y = c[i]-c[i-1]
        
        if x < y:
            t = 'NO'
            break
        elif x < 0 or y < 0:
            t = 'NO'
            break
        
    x = p[0]
    y = c[0]
        
    if x < y:
        t = 'NO'
    elif x < 0 or y < 0:
        t = 'NO'
    print(t)

C++ Code: 

#include <bits/stdc++.h>

using namespace std;

int main() 
{
    int t; cin >>t;
    while (t--)
    {
      int n; cin >>n;
      int x[n],y[n];
      
      for (int i=0;i<n;i++)
      cin >>x[i]>>y[i];
      
      int c=0;
      if (x[0]<y[0])
      c++;
      
      for (int i=1;i<n;i++)
      {
        if (x[i]<x[i-1] || y[i]<y[i-1] || y[i]>x[i] || x[i]-x[i-1]<y[i]-y[i-1])
        c++;
      }
      
      c>0 ? cout <<"NO\n" : cout <<"YES\n";
    }
    
    
    
    return 0;
}


Comments

Submit
0 Comments
More Questions

1B - Spreadsheet
1177A - Digits Sequence (Easy Edition)
1579A - Casimir's String Solitaire
287B - Pipeline
510A - Fox And Snake
1520B - Ordinary Numbers
1624A - Plus One on the Subset
350A - TL
1487A - Arena
1520D - Same Differences
376A - Lever
1305A - Kuroni and the Gifts
1609A - Divide and Multiply
149B - Martian Clock
205A - Little Elephant and Rozdil
1609B - William the Vigilant
978B - File Name
1426B - Symmetric Matrix
732B - Cormen --- The Best Friend Of a Man
1369A - FashionabLee
1474B - Different Divisors
1632B - Roof Construction
388A - Fox and Box Accumulation
451A - Game With Sticks
768A - Oath of the Night's Watch
156C - Cipher
545D - Queue
459B - Pashmak and Flowers
1538A - Stone Game
1454C - Sequence Transformation